Characterization of regular checkerboard colourable twisted duals of ribbon graphs
نویسندگان
چکیده
The geometric dual of a cellularly embedded graph is fundamental concept in theory and also appears many other branches mathematics. partial an essential generalization which can be obtained by forming the with respect to only subset edges graph. Twisted duality further from combining Petrials duals. Ribbon graphs are new equivalent form old graphs. In this paper, we first characterize regular duals ribbon using spanning quasi-tree its related nesting set. Then checkerboard colourable for any Eulerian trees notion adjoint Finally give complete characterization all twisted graph, solves problem raised Ellis-Monaghan Moffatt (2012) [10].
منابع مشابه
A Penrose polynomial for embedded graphs
We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial which can not be realized within the class of plane graphs. In particular, by exploiting connections with the transition polynomial and the ribbon group action...
متن کاملDiameter of 4-colourable graphs
We prove that for every connected 4-colourable graph G of order n and minimum degree δ ≥ 1, diam(G) ≤ 5n 2δ − 1. This is a first step toward proving a conjecture of Erdős, Pach, Pollack and Tuza [4] from 1989.
متن کاملNonequilibrium ribbon model of twisted scroll waves.
We formulate a reduced model to analyze the motion of the core of a twisted scroll wave. The model is first shown to provide a simple description of the onset and nonlinear evolution of the helical state appearing in the sproing bifurcation of scroll waves. It then serves to examine the experimentally studied case of a medium with spatially varying excitability. The model shows the role of spro...
متن کاملA Note on Uniquely H-colourable Graphs
For a graph H, we compare two notions of uniquely H-colourable graphs, where one is defined via automorphisms, the second by vertex partitions. We prove that the two notions of uniquely H-colourable are not identical for all H, and we give a condition for when they are identical. The condition is related to the first homomorphism theorem from algebra.
متن کاملA characterization of bipartite distance-regular graphs
Article history: Received 9 April 2013 Accepted 15 December 2013 Available online 13 January 2014 Submitted by R. Brualdi
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2021
ISSN: ['0097-3165', '1096-0899']
DOI: https://doi.org/10.1016/j.jcta.2021.105428